#include "heapsort.h"

int main(int argc, char * argv[])
{
	int r[] = {0, 48, 62, 35, 77, 55, 14, 35, 98};
	int n = sizeof(r)/sizeof(int);//first position if empty.

	printf("%d\n", n);

	output(r, n);

	printf("%d\n", n);

	HeapSort(r, n-1);

	output(r, n);

	printf("%d\n", n);

	return 0;

}
